Approximations for Chat Service Systems Using Many-Server Diffusion Limits
نویسندگان
چکیده
We study a queueing model of customer service chat (CSC) systems. A unique feature of these queueing systems is that a single agent can serve multiple customers simultaneously. We prove the convergence of the queueing process to di↵erent di↵usion processes in a many server heavy-tra c regime in three di↵erent cases. Using this result, we are able o↵er approximations for the steady state performance measures such as the number of customers in the system, the abandonment probability and the sojourn time of a customer. Our numerical experiments show that proposed approximations are accurate in various cases.
منابع مشابه
A New View of the Heavy-Traffic Limit Theorem for Infinite-Server Queues
This paper presents a new approach for obtaining heavy-traffic limits for infinite-server queues and open networks of infinite-server queues. The key observation is that infinite-server queues having deterministic service times can easily be analyzed in terms of the arrival counting process. A variant of the same idea applies when the service times take values in a finite set, so this is the ke...
متن کاملPositive Recurrence of Piecewise Ornstein–uhlenbeck Processes and Common Quadratic Lyapunov Functions1 by A. B. Dieker
We study the positive recurrence of piecewise Ornstein–Uhlenbeck (OU) diffusion processes, which arise from many-server queueing systems with phase-type service requirements. These diffusion processes exhibit different behavior in two regions of the state space, corresponding to “overload” (service demand exceeds capacity) and “underload” (service capacity exceeds demand). The two regimes cause...
متن کاملState Space Collapse in Many-Server Diffusion Limits of Parallel Server Systems
We consider a class of queueing systems that consist of server pools in parallel and multiple customer classes. Customer service times are assumed to be exponentially distributed. We study the asymptotic behavior of these queueing systems in a heavy traffic regime that is known as the Halfin and Whitt many-server asymptotic regime. Our main contribution is a general framework for establishing s...
متن کاملTwo fluid approximations for multi-server queues with abandonments
Insight is provided into a previously developed M/M/s/r + M(n) approximation for the M/GI/s/r + GI queueing model by establishing fluid and diffusion limits for the approximating model. Fluid approximations for the two models are compared in the many-server efficiency-driven (overloaded) regime. The two fluid approximations do not coincide, but they are close. Short title: Fluid Approximations
متن کاملPricing and Dimensioning Competing Large-Scale Service Providers
We consider a market with several large-scale service providers that compete on both prices and service levels as measured by the response time to a service request. The literature on many-server approximations provides significant simplifications towards the optimal capacity sizing of largescale monopolists but falls short of providing similar simplifications for a competition setting in which...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Oper. Res.
دوره 41 شماره
صفحات -
تاریخ انتشار 2016